Approximate solutions to Cauchy problems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Solutions to Optimal Stopping Problems

We propose and analyze an algorithm that approximates solutions to the problem of optimal stopping in a discounted irreducible aperiodic Markov chain. The scheme involves the use of linear combinations of fixed basis functions to approximate a Q-function. The weights of the linear combination are incrementally updated through an iterative process similar to Q-Iearning, involving simulation of t...

متن کامل

Stochastic Solutions for Fractional Cauchy Problems

Every infinitely divisible law defines a convolution semigroup that solves an abstract Cauchy problem. In the fractional Cauchy problem, we replace the first order time derivative by a fractional derivative. Solutions to fractional Cauchy problems are obtained by subordinating the solution to the original Cauchy problem. Fractional Cauchy problems are useful in physics to model anomalous diffus...

متن کامل

Continuous Solutions of Distributional Cauchy Problems

Existence of the smallest, greatest, minimal, maximal and unique continuous solutions to distributional Cauchy problems, as well as their dependence on the data, are studied. The main tools are a continuous primitive integral and fixed point results in function spaces.

متن کامل

Generalized Solutions to Nonlinear First Order Cauchy Problems

The recent significant enrichment, see [14] through [15], of the Order Completion Method for nonlinear systems of PDEs [12] resulted in the global existence of generalized solutions to a large class of such equations. In this paper we consider the existence and regularity of the generalized solutions to a family of nonlinear first order Cauchy problems. The spaces of generalized solutions are o...

متن کامل

Approximate Solutions of Continuous Dispersion Problems

The problem of positioning p points so as to maximize the minimum distance between them has been studied in both location theory (as the continuous p-dispersion problem) and the design of computer experiments (as the maximin distance design problem). This problem can be formulated as a nonlinear program, either exactly or approximately. We consider formulations of both types and demonstrate tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Differential Equations

سال: 1972

ISSN: 0022-0396

DOI: 10.1016/0022-0396(72)90050-2